Description: 匹配算法，Boyer-Moore-Hospool匹配算法
这个算法在大文件中搜索小pattern有很高效率。
推荐用来代替strstr()
这个实现我没有测过，不过应该不会有大问题。
C++的代码，容易使用：） -matching algorithm, Boyer - Moore-Hospool matching algorithm The algorithm in document search small pattern has a high efficiency. Suggest to replace strstr () I did not realize the test before but there should not be a big problem. C code, easier to use :) Platform: |
Size: 1134 |
Author:彭诗力 |
Hits:
Description: 首先采用灰度投影匹配进行全局运动估计和补偿，用以消除背景变化的影响；然后由二次差分抽取中间帧解决遮挡问题，通过Fisher 评价函数结合数学形态学填充得到运动对象分割掩膜，同时消除残余噪声以及平滑边缘。该方法在一定范围内较好地解决了遮挡问题，并能够高效快速地得到比较精确的视频对象。-first used for overall projection matching motion estimation and compensation, in order to remove the impact of changes in background; then by the second difference from the middle frame settlement block, Fisher evaluation function by combining mathematical morphology be filled Moving Object segmentation mask, while eliminating residual noise and edge smoothing. The method in a certain range to help solve the problem of shelter, and to the rapid and efficient access to more precise video objects. Platform: |
Size: 303049 |
Author:李杰 |
Hits:
Description: 10。《用于最优化的计算智能》，Nirwan Ansali，Edwin Hou着，李军，边肇棋译 清华大学出版社 1999年第一版
本书从讨论组合优化中的基本问题——NP问题入手，系统地讲述了近年来所发展起来的智能最优化的各种技术和方法，其中包括启发式搜索、Hopfield神经网络、模拟退火和随机机、均场退火以及遗传算法等；并在此基础上，通过一些典型的应用问题，如旅行商问题、模式识别中的点模式匹配问题、通信和任务调度等问题进一步阐明以上一些基本方法怎样用来解决这些原来具有NP性质的困难问题。本书是作者在美国新泽西州理工学院多年讲授有关课程的基础上写成的。全书深入浅出，理论联系实际。为帮助学生掌握基本概念，提高学习能动性，各章编写了习题。本书可作为通信、计算机、控制各专业的高年级学生和研究生学习有关课程的教材。它对于广大科研工作者也是一本很有实际价值的参考书。 -10. "Optimal for Computational Intelligence," Nirwan Ansali, with Edwin Hou, Li Jun, Pin Zhaoxing chess translation Tsinghua University Press in 1999 the first book version of combinatorial optimization from the discussion of basic questions -- NP problem start, the system described in recent years to develop the intelligent optimization of the technology and methods, These include heuristic search, Hopfield networks, simulated annealing and random machine, mean field annealing and genetic algorithms; and on this basis and through some typical applications, such as the traveling salesman problem, pattern recognition of point pattern matching, communication and task scheduling and other issues to further clarify some of these basic methods how to solve these with the original natu Platform: |
Size: 2560416 |
Author:孙东 |
Hits:
Description: 黑白点匹配问题，文件中有详细的问题描述与测试数据-black and white point matching, document a detailed description of the problem with the test data Platform: |
Size: 12121 |
Author:张亮 |
Hits:
Description: 实现括号匹配问题,我们经常遇到输入括号，却不知道括号是否搭配正确的问题，通过本程序可以实现自动检测括号是否匹配的问题(To achieve parentheses matching problem, we often encounter input brackets, but do not know whether brackets correct collocation problem, through this program can automatically detect brackets matching problem) Platform: |
Size: 975872 |
Author:sujun
|
Hits:
Description: RANSAC算法经常用于计算机视觉中。例如，在立体视觉领域中同时解决一对相机的匹配点问题及基本矩阵的计算。(RANSAC algorithms are often used in computer vision. For example, in the field of stereoscopic vision, a matching problem of a pair of cameras and a calculation of a basic matrix are simultaneously solved.) Platform: |
Size: 135168 |
Author:shiwel
|
Hits:
Description: RANSAC算法经常用于计算机视觉中。例如，在立体视觉领域中同时解决一对相机的匹配点问题及基本矩阵的计算。(RANSAC algorithms are often used in computer vision. For example, in the field of stereoscopic vision, a matching problem of a pair of cameras and a calculation of a basic matrix are simultaneously solved.) Platform: |
Size: 3072 |
Author:shiwel
|
Hits:
Description: 匈牙利算法，用于求解二分图的匈牙利算法，里面包含量两种求解方法，希望对大家有用。(Hungarian algorithm can be used to solve the bipartite matching problem , but it requires the bipartite graph to be completely symmetric. Hence we need to transform the original non-symmetric binary map matching problem into an absolute symmetric one.) Platform: |
Size: 4096 |
Author:脆皮猪 |
Hits:
Description: 用Python通过L1-penalized minimization problem实现人脸识别算法(Solve an L1-penalized minimization problem with the feature
sign search algorithm of Lee et al (2006).) Platform: |
Size: 2048 |
Author:sdfcsdca |
Hits:
Description: 自己写的基于matlab的二分图最优匹配求解问题的解决小程序(A small program for solving the optimal matching problem of two points based on MATLAB) Platform: |
Size: 1024 |
Author:等到0333 |
Hits:
Description: 大中小括号匹配问题
题目描述
假设表达式中允许四种括号：<>、()、[]、{}，它们的优先次序是由小到大的。其嵌套必须满足优先次序由大到小，例如：[()]或者{< [()] >}或(())等都为正确的匹配。形如：([])或([)]均为错误的匹配。
编写程序判断所给的括号串是否匹配。若匹配，则输出“YES”，否则输出“NO”。(Matching problem of large and medium parentheses
Title Description
Assuming that the expression allows four kinds of brackets: <, (), [], {}, their priorities are small to large. The nesting must satisfy the priority from large to small, for example: [[]] or] [([)] > (+) or (()) is the correct match. Forms such as: ([]) or ([)] are mismatched.) Platform: |
Size: 5120 |
Author:wangzhang |
Hits:
Description: 稳定婚姻问题算法，给定n男n女，以及每个人对异性对象的喜好程度（按1至n排列）。安排男女结婚，使得不出现以下不稳定情形：
在n男n女中的存在两对夫妇(M, W)和(m, w)，M男对w女喜好度大于现任妻子W女，并且w女对M男喜好度也大于现任丈夫m男。(In mathematics, economics, and computer science, the stable marriage problem (also stable matching problem or SMP) is the problem of finding a stable matching between two equally sized sets of elements given an ordering of preferences for each element. A matching is a mapping from the elements of one set to the elements of the other set. A matching is not stable if:
There is an element A of the first matched set which prefers some given element B of the second matched set over the element to which A is already matched, and
B also prefers A over the element to which B is already matched.
In other words, a matching is stable when there does not exist any match (A, B) by which both A and B would be individually better off than they are with the element to which they are currently matched.) Platform: |
Size: 1024 |
Author:peter1109 |
Hits:
Description: 求二分图最大匹配可以用最大流或者匈牙利算法。
最大匹配 给定一个二分图G，在G的一个子图M中，M的边集中的任意两条边都不依附于同一个顶点，则称M是一个匹配. 选择这样的边数最大的子集称为图的最大匹配问题 如果一个匹配中，图中的每个顶点都和图中某条边相关联，则称此匹配为完全匹配，也称作完备匹配。(For maximum matching of two partite graphs, maximum flow or Hungarian algorithm can be used.
The maximum match is given a two partite graph G. In a subgraph M of G, any two edges of the edge of the M are not attached to the same vertex, then it is called a match. The subset of the largest number of the edges of the graph is called the maximum matching problem of the graph if each vertex in the graph is associated with a certain edge in the graph. This match is called complete matching, also known as complete matching.) Platform: |
Size: 1024 |
Author:magician- |
Hits:
Search - matching problem